Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata, Logics, and Infinite Games [[electronic resource] ] : A Guide to Current Research / / edited by Erich Grädel, Wolfgang Thomas, Thomas Wilke
| Automata, Logics, and Infinite Games [[electronic resource] ] : A Guide to Current Research / / edited by Erich Grädel, Wolfgang Thomas, Thomas Wilke |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (VIII, 392 p.) |
| Disciplina | 004/.01/51 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer science Theory of Computation Computer Science, general |
| ISBN | 3-540-36387-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | ?-Automata -- Infinite Games -- Determinization and Complementation -- Determinization of Büchi-Automata -- Complementation of Büchi Automata Using Alternation -- Determinization and Complementation of Streett Automata -- Parity Games -- Memoryless Determinacy of Parity Games -- Algorithms for Parity Games -- Tree Automata -- Nondeterministic Tree Automata -- Alternating Tree Automata and Parity Games -- Modal ?-Calculus -- Modal ?-Calculus and Alternating Tree Automata -- Strictness of the Modal ?-Calculus Hierarchy -- Monadic Second-Order Logic -- Decidability of S1S and S2S -- The Complexity of Translating Logic to Finite Automata -- Expressive Power of Monadic Second-Order Logic and Modal ?-Calculus -- Tree-like Models -- Prefix-Recognizable Graphs and Monadic Logic -- The Monadic Theory of Tree-like Structures -- Two-Way Tree Automata Solving Pushdown Games -- Guarded Logics -- to Guarded Logics -- Automata for Guarded Fixed Point Logics -- Appendices -- Some Fixed Point Basics. |
| Record Nr. | UNINA-9910143897203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, Logics, and Infinite Games [[electronic resource] ] : A Guide to Current Research / / edited by Erich Grädel, Wolfgang Thomas, Thomas Wilke
| Automata, Logics, and Infinite Games [[electronic resource] ] : A Guide to Current Research / / edited by Erich Grädel, Wolfgang Thomas, Thomas Wilke |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (VIII, 392 p.) |
| Disciplina | 004/.01/51 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer science Theory of Computation Computer Science, general |
| ISBN | 3-540-36387-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | ?-Automata -- Infinite Games -- Determinization and Complementation -- Determinization of Büchi-Automata -- Complementation of Büchi Automata Using Alternation -- Determinization and Complementation of Streett Automata -- Parity Games -- Memoryless Determinacy of Parity Games -- Algorithms for Parity Games -- Tree Automata -- Nondeterministic Tree Automata -- Alternating Tree Automata and Parity Games -- Modal ?-Calculus -- Modal ?-Calculus and Alternating Tree Automata -- Strictness of the Modal ?-Calculus Hierarchy -- Monadic Second-Order Logic -- Decidability of S1S and S2S -- The Complexity of Translating Logic to Finite Automata -- Expressive Power of Monadic Second-Order Logic and Modal ?-Calculus -- Tree-like Models -- Prefix-Recognizable Graphs and Monadic Logic -- The Monadic Theory of Tree-like Structures -- Two-Way Tree Automata Solving Pushdown Games -- Guarded Logics -- to Guarded Logics -- Automata for Guarded Fixed Point Logics -- Appendices -- Some Fixed Point Basics. |
| Record Nr. | UNISA-996465276203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic [[electronic resource] ] : 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers / / edited by Mogens Nielsen, Wolfgang Thomas
| Computer Science Logic [[electronic resource] ] : 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers / / edited by Mogens Nielsen, Wolfgang Thomas |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (VIII, 520 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Architecture, Computer Mathematical logic Computer logic Artificial Intelligence Computer System Implementation Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-69353-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Call-by-value games -- LISA: A specification language based on WS2S -- Evolution as a computational engine -- Timeless games -- From action calculi to linear logic -- A sequent calculus for circumscription -- Linear lower bounds and simulations in frege systems with substitutions -- A formulation of linear logic based on dependency-relations -- Resolution and the weak pigeonhole principle -- Higher-order matching and tree automata -- A proof-theoretical investigation of Zantema's problem -- Spectra with only unary function symbols -- Classical proofs via basic logic -- Canonization for Lk-equivalence is Hard -- Full abstractness for a functional/concurrent language with higher-order value-passing -- A duality theory for quantitative semantics -- A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion -- Equational axioms of test algebra -- Mona & Fido: The logic-automaton connection in practice -- Existence of reduction hierarchies -- A game-theoretic, concurrent and fair model of the typed ?-calculus, with full recursion -- A conjunctive logical characterization of nondeterministic linear time -- On the computational complexity of type 2 functionals -- Categories with algebraic structure -- Concurrent constraint programming and non-commutative logic -- A hierarchical approach to monadic second-order logic over graphs -- The monadic quantifier alternation hierarchy over grids and pictures -- Padding and the expressive power of existential second-order logics -- Rich ?-words and monadic second-order arithmetic -- A simple ordinal recursive normalization of Gödel's T. |
| Record Nr. | UNINA-9910144911503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Science Logic [[electronic resource] ] : 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers / / edited by Mogens Nielsen, Wolfgang Thomas
| Computer Science Logic [[electronic resource] ] : 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers / / edited by Mogens Nielsen, Wolfgang Thomas |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (VIII, 520 p.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Architecture, Computer Mathematical logic Computer logic Artificial Intelligence Computer System Implementation Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-69353-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Call-by-value games -- LISA: A specification language based on WS2S -- Evolution as a computational engine -- Timeless games -- From action calculi to linear logic -- A sequent calculus for circumscription -- Linear lower bounds and simulations in frege systems with substitutions -- A formulation of linear logic based on dependency-relations -- Resolution and the weak pigeonhole principle -- Higher-order matching and tree automata -- A proof-theoretical investigation of Zantema's problem -- Spectra with only unary function symbols -- Classical proofs via basic logic -- Canonization for Lk-equivalence is Hard -- Full abstractness for a functional/concurrent language with higher-order value-passing -- A duality theory for quantitative semantics -- A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion -- Equational axioms of test algebra -- Mona & Fido: The logic-automaton connection in practice -- Existence of reduction hierarchies -- A game-theoretic, concurrent and fair model of the typed ?-calculus, with full recursion -- A conjunctive logical characterization of nondeterministic linear time -- On the computational complexity of type 2 functionals -- Categories with algebraic structure -- Concurrent constraint programming and non-commutative logic -- A hierarchical approach to monadic second-order logic over graphs -- The monadic quantifier alternation hierarchy over grids and pictures -- Padding and the expressive power of existential second-order logics -- Rich ?-words and monadic second-order arithmetic -- A simple ordinal recursive normalization of Gödel's T. |
| Record Nr. | UNISA-996466079503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Logic [[electronic resource] /] / by H.-D. Ebbinghaus, J. Flum, Wolfgang Thomas
| Mathematical Logic [[electronic resource] /] / by H.-D. Ebbinghaus, J. Flum, Wolfgang Thomas |
| Autore | Ebbinghaus H.-D |
| Edizione | [2nd ed. 1994.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (X, 291 p.) |
| Disciplina | 511.3 |
| Collana | Undergraduate Texts in Mathematics |
| Soggetto topico |
Mathematical logic
Mathematics—Study and teaching Mathematical Logic and Foundations Mathematics Education |
| ISBN | 1-4757-2355-5 |
| Classificazione | 03-01 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A -- I Introduction -- II Syntax of First-Order Languages -- III Semantics of First-Order Languages -- IV A Sequent Calculus -- V The Completeness Theorem -- VI The Löwenheim-Skolem and the Compactness Theorem -- VII The Scope of First-Order Logic -- VIII Syntactic Interpretations and Normal Forms -- B -- IX Extensions of First-Order Logic -- X Limitations of the Formal Method -- XI Free Models and Logic Programming -- XII An Algebraic Characterization of Elementary Equivalence -- XIII Lindström’s Theorems -- References -- Symbol Index. |
| Record Nr. | UNINA-9910480732103321 |
Ebbinghaus H.-D
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Logic [[electronic resource] /] / by H.-D. Ebbinghaus, J. Flum, Wolfgang Thomas
| Mathematical Logic [[electronic resource] /] / by H.-D. Ebbinghaus, J. Flum, Wolfgang Thomas |
| Autore | Ebbinghaus Heinz-Dieter <1939-> |
| Edizione | [2nd ed. 1994.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (X, 291 p.) |
| Disciplina | 511.3 |
| Collana | Undergraduate Texts in Mathematics |
| Soggetto topico |
Mathematical logic
Mathematics—Study and teaching Mathematical Logic and Foundations Mathematics Education |
| ISBN | 1-4757-2355-5 |
| Classificazione | 03-01 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A -- I Introduction -- II Syntax of First-Order Languages -- III Semantics of First-Order Languages -- IV A Sequent Calculus -- V The Completeness Theorem -- VI The Löwenheim-Skolem and the Compactness Theorem -- VII The Scope of First-Order Logic -- VIII Syntactic Interpretations and Normal Forms -- B -- IX Extensions of First-Order Logic -- X Limitations of the Formal Method -- XI Free Models and Logic Programming -- XII An Algebraic Characterization of Elementary Equivalence -- XIII Lindström’s Theorems -- References -- Symbol Index. |
| Record Nr. | UNINA-9910792487603321 |
|
Ebbinghaus Heinz-Dieter <1939->
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Logic [[electronic resource] /] / by H.-D. Ebbinghaus, J. Flum, Wolfgang Thomas
| Mathematical Logic [[electronic resource] /] / by H.-D. Ebbinghaus, J. Flum, Wolfgang Thomas |
| Autore | Ebbinghaus Heinz-Dieter <1939-> |
| Edizione | [2nd ed. 1994.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (X, 291 p.) |
| Disciplina | 511.3 |
| Collana | Undergraduate Texts in Mathematics |
| Soggetto topico |
Mathematical logic
Mathematics—Study and teaching Mathematical Logic and Foundations Mathematics Education |
| ISBN | 1-4757-2355-5 |
| Classificazione | 03-01 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A -- I Introduction -- II Syntax of First-Order Languages -- III Semantics of First-Order Languages -- IV A Sequent Calculus -- V The Completeness Theorem -- VI The Löwenheim-Skolem and the Compactness Theorem -- VII The Scope of First-Order Logic -- VIII Syntactic Interpretations and Normal Forms -- B -- IX Extensions of First-Order Logic -- X Limitations of the Formal Method -- XI Free Models and Logic Programming -- XII An Algebraic Characterization of Elementary Equivalence -- XIII Lindström’s Theorems -- References -- Symbol Index. |
| Record Nr. | UNINA-9910808752903321 |
|
Ebbinghaus Heinz-Dieter <1939->
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 2006 [[electronic resource] ] : 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings / / edited by Bruno Durand, Wolfgang Thomas
| STACS 2006 [[electronic resource] ] : 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings / / edited by Bruno Durand, Wolfgang Thomas |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIX, 714 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science Discrete Mathematics in Computer Science |
| ISBN | 3-540-32288-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Ubiquitous Digital Tree -- Flat Holonomies on Automata Networks -- Interprocedurally Analyzing Polynomial Identities -- External String Sorting: Faster and Cache-Oblivious -- Amortized Rigidness in Dynamic Cartesian Trees -- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes -- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms -- Equivalence of -Algebras and Cubic Forms -- Complete Codes in a Sofic Shift -- Kolmogorov Complexity with Error -- Kolmogorov Complexity and the Recursion Theorem -- Entanglement in Interactive Proof Systems with Binary Answers -- Quantum Algorithms for Matching and Network Flows -- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound -- Estimating Entropy and Entropy Norm on Data Streams -- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems -- Exact Price of Anarchy for Polynomial Congestion Games -- Oblivious Symmetric Alternation -- Combining Multiple Heuristics -- Conflict-Free Colorings of Rectangles Ranges -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Theory and Application of Width Bounded Geometric Separator -- Invariants of Automatic Presentations and Semi-synchronous Transductions -- On the Accepting Power of 2-Tape Büchi Automata -- Weighted Picture Automata and Weighted Logics -- Markov Decision Processes with Multiple Objectives -- The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms -- Convergence and Approximation in Potential Games -- Fast FPT-Algorithms for Cleaning Grids -- Tradeoffs in Depth-Two Superconcentrators -- On Hypergraph and Graph Isomorphism with Bounded Color Classes -- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences -- Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets -- Regularity Problems for Visibly Pushdown Languages -- Regular Expressions and NFAs Without ?-Transitions -- Redundancy in Complete Sets -- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds -- Linear Advice for Randomized Logarithmic Space -- Nested Pebbles and Transitive Closure -- Definability of Languages by Generalized First-Order Formulas over (N,+) -- Generalized Modal Satisfiability -- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games -- DAG-Width and Parity Games -- Reliable Computations Based on Locally Decodable Codes -- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements -- A Faster Algorithm for the Steiner Tree Problem -- Generating Randomized Roundings with Cardinality Constraints and Derandomizations -- Online Sorting Buffers on Line -- Optimal Node Routing -- Memoryless Facility Location in One Pass -- Energy-Efficient Algorithms for Flow Time Minimization -- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games -- Datalog and Constraint Satisfaction with Infinite Templates -- Evaluating Monotone Circuits on Cylinders, Planes and Tori -- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two -- Weighted Asynchronous Cellular Automata -- On the Complexity of the “Most General” Firing Squad Synchronization Problem. |
| Record Nr. | UNISA-996466154303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2006 [[electronic resource] ] : 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings / / edited by Bruno Durand, Wolfgang Thomas
| STACS 2006 [[electronic resource] ] : 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings / / edited by Bruno Durand, Wolfgang Thomas |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIX, 714 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science Discrete Mathematics in Computer Science |
| ISBN | 3-540-32288-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Ubiquitous Digital Tree -- Flat Holonomies on Automata Networks -- Interprocedurally Analyzing Polynomial Identities -- External String Sorting: Faster and Cache-Oblivious -- Amortized Rigidness in Dynamic Cartesian Trees -- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes -- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms -- Equivalence of -Algebras and Cubic Forms -- Complete Codes in a Sofic Shift -- Kolmogorov Complexity with Error -- Kolmogorov Complexity and the Recursion Theorem -- Entanglement in Interactive Proof Systems with Binary Answers -- Quantum Algorithms for Matching and Network Flows -- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound -- Estimating Entropy and Entropy Norm on Data Streams -- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems -- Exact Price of Anarchy for Polynomial Congestion Games -- Oblivious Symmetric Alternation -- Combining Multiple Heuristics -- Conflict-Free Colorings of Rectangles Ranges -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Theory and Application of Width Bounded Geometric Separator -- Invariants of Automatic Presentations and Semi-synchronous Transductions -- On the Accepting Power of 2-Tape Büchi Automata -- Weighted Picture Automata and Weighted Logics -- Markov Decision Processes with Multiple Objectives -- The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms -- Convergence and Approximation in Potential Games -- Fast FPT-Algorithms for Cleaning Grids -- Tradeoffs in Depth-Two Superconcentrators -- On Hypergraph and Graph Isomorphism with Bounded Color Classes -- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences -- Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets -- Regularity Problems for Visibly Pushdown Languages -- Regular Expressions and NFAs Without ?-Transitions -- Redundancy in Complete Sets -- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds -- Linear Advice for Randomized Logarithmic Space -- Nested Pebbles and Transitive Closure -- Definability of Languages by Generalized First-Order Formulas over (N,+) -- Generalized Modal Satisfiability -- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games -- DAG-Width and Parity Games -- Reliable Computations Based on Locally Decodable Codes -- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements -- A Faster Algorithm for the Steiner Tree Problem -- Generating Randomized Roundings with Cardinality Constraints and Derandomizations -- Online Sorting Buffers on Line -- Optimal Node Routing -- Memoryless Facility Location in One Pass -- Energy-Efficient Algorithms for Flow Time Minimization -- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games -- Datalog and Constraint Satisfaction with Infinite Templates -- Evaluating Monotone Circuits on Cylinders, Planes and Tori -- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two -- Weighted Asynchronous Cellular Automata -- On the Complexity of the “Most General” Firing Squad Synchronization Problem. |
| Record Nr. | UNINA-9910768161803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||